A Randomized Testbench for Algorithms Translating Linear Temporal Logic Formulae into Büchi Automata
نویسنده
چکیده
منابع مشابه
Runtime Analysis of Linear Temporal Logic Specifications
This report presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard...
متن کاملAutomata-Based Verification of Temporal Properties on Running Programs
This paper presents an approach to checking a running program against Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finitestate automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL t...
متن کاملRabinizer: Small Deterministic Automata for LTL(F, G)
We present Rabinizer, a tool for translating formulae of the fragment of linear temporal logic with the operators F (eventually) and G (globally) into deterministic Rabin automata. Contrary to tools like ltl2dstar, which translate the formula into a Büchi automaton and apply Safra’s determinization procedure, Rabinizer uses a direct construction based on the logical structure of the formulae. W...
متن کاملGOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae
In this paper, we present a tool named GOAL (an acronym derived from “Graphical Tool for OmegaAutomata and Logics”) whose main functions include (1) drawing and testing Büchi automata, (2) checking the language equivalence between two Büchi automata, (3) translating quantified propositional linear temporal logic (QPTL) formulae into equivalent Büchi automata, and (4) exporting Büchi automata as...
متن کاملFrom States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into Büchi automata in order to be checked. This paper describes how, by labeling automata transitions rather than states, we significantly reduce the size of autom...
متن کامل